Stability of a Multicast Tree

Most of the currently deployed multicast protocols (e.g. DVMRP, PIM, MOSPF) build one shortest path multicast tree per sender, the tree being rooted at the sender’s subnetwork. This paper examines the stability of such a tree, specifically, ”How does the number of links change as the number of multicast users in a group changes?” Two modelling assumptions are made. We assume that (a) packets are delivered along the shortest path tree (which is a realistic assumption as indicated above) and that (b) the m multicast group member nodes are chosen uniformly out of the total number of nodes N . The probability density function for the number of changed edges∆N (m) when one multicast user joins or leaves the group is studied. For random graphs of the class Gp (N) withN nodes, link density p and with uniformly (or exponentially) distributed link weights, the probability density function Pr [∆N (m) = k] is proved to tend to a Poisson distribution for large N . The proof of this theorem enables a generalization to an arbitrary topology. Simulations, mainly conducted to quantify the validity of the asymptotic regime, reveal that the Poisson law seems more widely valid than just in the asymptotic regime where N → ∞. In addition, the effect of the link weight distribution on the stability of the multicast tree is investigated. Finally, the stability of a Steiner tree connecting m multicast users is compared to the shortest path tree via simulations.